Similarity measures for convex polyhedra based on Minkowski addition

نویسندگان

  • Alexander V. Tuzikov
  • Jos B. T. M. Roerdink
  • Henk J. A. M. Heijmans
چکیده

In this paper we introduce and investigate similarity measures for convex polyhedra based on Minkowski addition and inequalities for the mixed volume, volume and surface area related to the Brunn-Minkowski theory. All measures considered are invariant under translations; furthermore, they may also be invariant under subgroups of the aane transformation group. For the case of rotation and scale invariance, we prove that to obtain the measures based on (mixed) volume, it is suucient to compute certain functionals only for a nite number of critical rotations. Extensive use is made of the slope diagram representation of convex polyhedra.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing the Time Complexity and Identifying Ill-posed Problem Instances of Minkowski Sum Based Similarity calculations

To calculate the Minkowski-sum based similarity measure of two convex polyhedra, many relative orientations have to be considered. These relative orientations are characterized by the fact that some faces and edges of the polyhedra are parallel. For every relative orientation of the polyhedra, the volume or mixed volume of their Minkowski sum is evaluated. From the minimum of this volume, the s...

متن کامل

FIMS: a New and Efficient Algorithm for the Computation of Minkowski Sum of Convex Polyhedra

The Minkowski sum computation and implementation in 2D and 3D domains is of a particular interest because it has a large number of applications in many domains such as: mathematical morphology, image processing and analysis, robotics, spatial planning, computer aided design and manufacturing, image processing ... However, no exact, fast, and general algorithms are found in the literature. We pr...

متن کامل

Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications

We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it produces exact results. We also present applications of the Minkowski-sum computation to answer collision and proximity queries about the relative p...

متن کامل

Similarity and Symmetry Measures for Convex Shapes Using Minkowski Addition

This paper is devoted to similarity and symmetry measures for convex shapes whose deenition is based on Minkowski addition and the Brunn-Minkowski inequality. This means in particular that these measures are region-based, in contrast to most of the literature, where one considers contour-based measures. All measures considered in this paper are invariant under translations; furthermore, they ca...

متن کامل

Reducing the Time Complexity of Minkowski-Sum Based Similarity Calculations by Using Geometric Inequalities

The similarity of two convex polyhedra A and B may be calculated by evaluating the volume or mixed volume of their Minkowski sum over a specific set of relative orientations. The relative orientations are characterized by the fact that faces and edges of A and B are parallel as much as possible. For one of these relative orientations the similarity measure is optimal. In this article we propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pattern Recognition

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2000